import sys
def get_numbers():
return map(int, sys.stdin.readline().strip().split())
n = int(input())
numbers = list(get_numbers())
numbers = sorted(numbers)
print(' '.join(str(number) for number in numbers))#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fo(i, n) for (ll i = 0; i < n; i++)
#define fox(i, k, n) for (ll i = k; i < n; i++)
#define print(x) cout << x << endl
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n,i,j,temp=0;
cin>>n;
ll a[n];
for(i=0;i<n;i++){
cin>>a[i];
}
sort(a,a+n);
for(i=0;i<n;i++){
cout<<a[i];
cout<<" ";
}
}1920. Build Array from Permutation | 494. Target Sum |
797. All Paths From Source to Target | 1547B - Alphabetical Strings |
1550A - Find The Array | 118B - Present from Lena |
27A - Next Test | 785. Is Graph Bipartite |
90. Subsets II | 1560A - Dislike of Threes |
36. Valid Sudoku | 557. Reverse Words in a String III |
566. Reshape the Matrix | 167. Two Sum II - Input array is sorted |
387. First Unique Character in a String | 383. Ransom Note |
242. Valid Anagram | 141. Linked List Cycle |
21. Merge Two Sorted Lists | 203. Remove Linked List Elements |
733. Flood Fill | 206. Reverse Linked List |
83. Remove Duplicates from Sorted List | 116. Populating Next Right Pointers in Each Node |
145. Binary Tree Postorder Traversal | 94. Binary Tree Inorder Traversal |
101. Symmetric Tree | 77. Combinations |
46. Permutations | 226. Invert Binary Tree |